Maximally Equidistributed Decimated GFSR Generators
نویسنده
چکیده
This paper presents generators based on decimated sequences of Generalized Feedback Shift Register (GFSR) generators. The equivalence relation between decimated GFSR generators and Tausworthe generators are presented and a k-distributed initialization scheme is derived. We present decimated GFSR generators that are maximally equidistributed. Timing results of these generators are presented.
منابع مشابه
Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2
Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR generators. Low-discrepancy point sets for quasi-Monte Carlo integration can also be constructed based on these linear recurrences. The quality of these generators or point sets is usually measured by c...
متن کاملMaximally equidistributed combined Tausworthe generators
Tausworthe random number generators based on a primitive trinomial allow an easy and fast implementation when their parameters obey certain restrictions. However, such generators, with those restrictions, have bad statistical properties unless we combine them. A generator is called maximally equidistributed if its vectors of successive values have the best possible equidistribution in all dimen...
متن کاملTables of maximally equidistributed combined LFSR generators
We give the results of a computer search for maximally equidistributed combined linear feedback shift register (or Tausworthe) random number generators, whose components are trinomials of degrees slightly less than 32 or 64. These generators are fast and have good statistical properties.
متن کاملGambling Tests for Pseudorandom Number Generators
This paper extends the idea of serial tests by employing a carefully selected dimension reduction which is equivalent to playing a gambling strategy in a fair coin ipping game. We apply the generalized-divergence for testing the hypothesis that the simulated coin is fair and memoryless. An application to Twisted GFSR generators shows the ability of our test to detect deviations from equidistrib...
متن کاملImproved Long-Period Generators Based on Linear Recurrences
Fast uniform random number generators with extremely long periods have been defined and implemented based on linear recurrences modulo 2. The twisted GFSR and the Mersenne twister are famous recent examples. Besides the period length, the statistical quality of these generators is usually assessed via their equidistribution properties. The huge-period generators proposed so far are not quite op...
متن کامل